Supporting Lock-Free Composition of Concurrent Data Objects: Moving Data between Containers

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lock-free Concurrent Data Structures

Concurrent data structures are the data sharing side of parallel programming. Data structures give the means to the program to store data, but also provide operations to the program to access and manipulate these data. These operations are implemented through algorithms that have to be efficient. In the sequential setting, data structures are crucially important for the performance of the respe...

متن کامل

Practical considerations for lock-free concurrent objects

A n important class of concurrent objec t s are those that are lock-free, tha t is, whose operat ions are not conta ined wi th in mutua l ly exclusive critical sect ions . A lock-free object can be accessed by m a n y threads at a t ime , yet clever u p d a t e protocols based on a t o m i c C o m p a r e A n d S w a p operat ions guarantee the object ' s consistency. In th is paper we take a p...

متن کامل

Lock-Free Techniques for Concurrent Access to Shared Objects

Concurrent access to shared data in preemptive multi-tasks environment and in multi-processors architecture have been subject of many works. Proposed solutions are commonly based on semaphores which have several drawbacks. For many cases, lock-free techniques constitute an alternate solution and avoid the disadvantages of semaphore based techniques. We present the principle of these lock-free t...

متن کامل

Lock-Free Data-Structure Iterators

Concurrent data structures are often used with large concurrent software. An iterator that traverses the data structure items is a highly desirable interface that often exists for sequential data structures but is missing from (almost all) concurrent data-structure implementations. In this paper we introduce a technique for adding a linearizable wait-free iterator to a wait-free or a lock-free ...

متن کامل

Data Management for Moving Objects

We model a moving object as a sizable physical entity equipped with GPS, wireless communication capability, and a computer such as a PDA. Furthermore, we have observed that a real trajectory of a moving object is the result of interactions among moving objects in the system yielding a polyline instead of a line segment. In this paper, we first choose a partitioning approach to efficiently manag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computers

سال: 2013

ISSN: 0018-9340

DOI: 10.1109/tc.2012.248